Metrization of proximity spaces

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quotients of Proximity Spaces

A characterization of the quotient proximity is given. It is used to find necessary and sufficient conditions for every proximity map on a space to be a topological quotient map. It is shown that a separated proximity space is compact iff every /7-map on X with separated range is a proximity quotient map. Introduction. In 1959 Katetov [3] introduced proximity quotient maps. They have since been...

متن کامل

Smooth biproximity spaces and P-smooth quasi-proximity spaces

The notion of smooth biproximity space  where $delta_1,delta_2$ are gradation proximities defined by Ghanim et al. [10]. In this paper, we show every smooth biproximity space $(X,delta_1,delta_2)$ induces a supra smooth proximity space $delta_{12}$ finer than $delta_1$ and $delta_2$. We study the relationship between $(X,delta_{12})$ and the $FP^*$-separation axioms which had been introduced by...

متن کامل

Intuitionistic fuzzy proximity spaces

We introduce the concept of the intuitionistic fuzzy proximity as a generalization of fuzzy proximity, and investigate its properties. Also we investigate the relationship among intu-itionistic fuzzy proximity and fuzzy proximity, and intuitionistic fuzzy topology. 1. Introduction. As a generalization of fuzzy sets, the concept of intuitionistic fuzzy sets was introduced by Atanassov [1]. Recen...

متن کامل

Nagata-Smirnov Metrization Theorem.nb

Introduction: The Nagata-Smirnov Metrization theorem gives a full characterization of metrizable topological spaces. In other words, the theorem describes the necessary and sufficient conditions for a topology on a space to be defined using some metric. As a motivational example, consider the discrete topology on some space (every subset of the space is open). Though it might not be apparent to...

متن کامل

Channel Metrization

We present an algorithm that, given a channel, determines if there is a distance for it such that the maximum likelihood decoder coincides with the minimum distance decoder. We also show that any metric, up to a decoding equivalence, can be isometrically embedded into the hypercube with the Hamming metric, and thus, in terms of decoding, the Hamming metric is universal. keywords: Coding Theory;...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1967

ISSN: 0002-9939

DOI: 10.1090/s0002-9939-1967-0217757-6